Optimal Multiserver Stochastic Scheduling of two Interconnected Priority Queues
نویسندگان
چکیده
منابع مشابه
Towards Optimal Scheduling of Multiserver System Components
Until recently, microkernel-based multiserver systems could not match the performance of monolithic designs due to their architectural choices which prefer high reliability over high performance. With the advent of multicore processors, heterogeneous and over-provisioned architectures, it is possible to employ multiple cores to run individual components of the system, avoid expensive context sw...
متن کاملOptimal Purely Functional Priority Queues
Brodal recently introduced the first implementation of imperative priority queues to support findMin, insert, and meld in O(1) worst-case time, and deleteMin in O(log n) worst-case time. These bounds are asymptotically optimal among all comparison-based priority queues. In this paper, we adapt Brodal’s data structure to a purely functional setting. In doing so, we both simplify the data structu...
متن کاملOptimal scheduling of parallel queues using stochastic flow models
We consider a classic scheduling problem for optimally allocating a resource to multiple competing users and place it in the framework of Stochastic Flow Models (SFMs). We derive Infinitesimal Perturbation Analysis (IPA) gradient estimators for the average holding cost with respect to resource allocation parameters. These estimators are easily obtained from a sample path of the system without a...
متن کاملScheduling for Optimal Response Times in Queues of Stochastic Workflows
We investigate the problem of scheduling tasks of structured workflows, given a stochastic arrival of workflow instances, which gives rise to a queue. Each workflow conforms to a known structure expressed by a directed acyclic graph. However, within this model, the precise execution time of each atomic task and the delay of each communication edge are non-deterministic. Unlike in most schedulin...
متن کاملOptimal static priority rules for stochastic scheduling with impatience
We consider a stochastic scheduling problem with impatience to the end of service or impatience to the beginning of service. The impatience of a job can be seen as a stochastic due date. Processing times and due dates are random variables. Jobs are processed on a single machine with the objective to minimize the expected weighted number of tardy jobs in the class of static list scheduling polic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 1994
ISSN: 0001-8678,1475-6064
DOI: 10.1017/s0001867800026112